Strongly Connected Component

Strongly Connected Component
Software: SCC

Универсальный русско-английский словарь. . 2011.

Нужен реферат?

Смотреть что такое "Strongly Connected Component" в других словарях:

  • Strongly connected component — Graph with strongly connected components marked A directed graph is called strongly connected if there is a path from each vertex in the graph to every other vertex. In particular, this means paths in each direction; a path from a to b and also a …   Wikipedia

  • strongly connected component — noun Given a directed graph, a maximal strongly connected subgraph. See Also: connected component, partition …   Wiktionary

  • Connected component (graph theory) — A graph with three connected components. In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices. For example,… …   Wikipedia

  • connected component — noun A connected subset that is, moreover, maximal with respect to being connected. See Also: strongly connected component …   Wiktionary

  • Tarjan's strongly connected components algorithm — Tarjan s Algorithm (named for its discoverer, Robert Tarjan) is a graph theory algorithm for finding the strongly connected components of a graph. It can be seen as an improved version of Kosaraju s algorithm, and is comparable in efficiency to… …   Wikipedia

  • Component — may refer to: Usage Component may refer to: System components, the constituents of a system Electronic components, the constituents of electronic circuits Component ingredient, the main ingredient in a dish Component video, a type of analog video …   Wikipedia

  • 2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …   Wikipedia

  • Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …   Wikipedia

  • Aperiodic graph — In the mathematical area of graph theory, a directed graph is said to be aperiodic if there is no integer k > 1 that divides the length of every cycle of the graph. Equivalently, a graph is aperiodic if the greatest common divisor of the lengths… …   Wikipedia

  • Connectedness — This article is about mathematics. For other uses, see Connectedness (disambiguation). In mathematics, connectedness is used to refer to various properties meaning, in some sense, all one piece . When a mathematical object has such a property, we …   Wikipedia

  • List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»